A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
نویسندگان
چکیده
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also give an effective Craig interpolation lemma for regular grammar logics using our calculus.
منابع مشابه
Tableaux for Regular Grammar Logics of Agents Using Automaton-Modal Formulae
We present sound and complete tableau calculi for the class of regular grammar logics and a class eRG of extended regular grammar logics which contains useful epistemic logics for reasoning about beliefs of agents. Our tableau rules use a special feature called automaton-modal formulae which are similar to formulae of automaton propositional dynamic logic. Our calculi are cut-free and have the ...
متن کاملAnalytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular grammar logics which contains useful epistemic logics for reasoning about agent beliefs. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. Applying sound global caching to the calculus, we obtain the first optimal (EXPTime) tableau decision procedure for BReg...
متن کاملGrammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse [a]−1. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without conver...
متن کاملLabelled Tableau Calculi Generating Simple Models for Substructural Logics∗
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order to obtain a deductive framework for substructural logics which incorporates the facility of model generation. For this special purpose, we propose new labelled tableau calculi TL and TLe for two substructural logics L (essentially the Lambek calculus) and Le (the multiplicative fragment of intuit...
متن کاملExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
Grammar logics were introduced by Fariñas del Cerro and Penttonen in [7] and have been widely studied. In this paper we consider regular grammar logics with converse (REG logics) and present sound and complete tableau calculi for the general satisfiability problem of REG logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG logic. Using our calculi we develop ExpTime ...
متن کامل